Sharpness in rates of convergence for the symmetric Lanczos method
نویسندگان
چکیده
منابع مشابه
Sharpness in rates of convergence for the symmetric Lanczos method
The Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the rates of convergence good for a few extreme eigenpairs. These bounds suggest at least linear convergence in terms of the number of Lanczos steps, assuming there are gaps between individual eigenvalues. In practice, o...
متن کاملSharpness in Rates of Convergence For CG and Symmetric Lanczos Methods
Conjugate Gradient (CG) method is often used to solve a positive definite linear system Ax = b. Existing bounds suggest that the residual of the kth approximate solution by CG goes to zero like [( √ κ− 1)/(√κ + 1)], where κ ≡ κ(A) = ‖A‖2‖A−1‖2 is A’s spectral condition number. It is well-known that for a given positive definite linear system, CG may converge (much) faster, known as superlinear ...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Superlinear Convergence Rates for the Lanczos Method Applied to Elliptic Operators
This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic diierential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. These results are illustrated numerically for a more diicult problem.
متن کاملConvergence of the block Lanczos method for eigenvalue clusters
The Lanczos method is often used to solve a large scale symmetric matrix eigen-value problem. It is well-known that the single-vector Lanczos method can only find one copy of any multiple eigenvalue and encounters slow convergence towards clustered eigenvalues. On the other hand, the block Lanczos method can compute all or some of the copies of a multiple eigenvalue and, with a suitable block s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2010
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-09-02258-3